Diagnosing Distributed Systems Modeled by Communicating Finite State Machines

نویسنده

  • A. Ghedamsi
چکیده

We propose a diagnostic algorithm for the case where a distributed system specification (implementation) is given in the form of communicating finite state machines (CFSMs). Such an algorithm localizes the faulty transition in the distributed system once the fault has been detected. It generates, if necessary, additional diagnostic test cases which depend on the observed symptoms and which permit the location of the detected fault. The algorithm guarantees the correct diagnosis of any single (output or transfer) fault in a system of communicating FSMs. A simple example is used to demonstrate the functioning of the different steps of the proposed diagnostic algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Basic Behavior Modeling for Monitored Objects in Distributed Systems by Using Communicating Finite State Machine

Distributed systems are complex systems, and there are a lot of the potential risks while the system is operating, so administrators must have effective monitoring tools for network management to ensure stability and performance of distributed systems. The monitoring for behaviors of objects in the system is essential to support administrators in detecting abnormal states or events quickly as w...

متن کامل

Prototyping distributed multimedia systems using communicating real-time state machines

This paper describes a methodology for the development of real-time systems and shows its application to the modeling, analysis and implementation of distributed multimedia systems. The methodology is centered on Communicating Real-Time State Machines as the modeling language and is supported by a Java toolset (jCRSM). The latter provides a graphical environment for editing, testing, debugging ...

متن کامل

Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues

We address the verification of communication protocols or distributed systems that can be modeled by Communicating Finite State Machines (CFSMs), i.e. a set of sequential machines communicating via unbounded FIFO channels. Unlike recent related works based on acceleration techniques, we propose to apply the Abstract Interpretation approach to such systems, which consists in using approximated r...

متن کامل

Fault-Tolerance Verification in a Distributed Collective Collaborative Robotic System

In this paper, we model a collective collaborative robotic system which acts as a distributed system, solving the problem which a single robot cannot. A system consisting of n processes is modeled by a respective set of n communicating finite-state machines (CFSMs). Robotic processes often run concurrently and communicate with each other to accomplish a common goal. We begin from a specificatio...

متن کامل

Restricted cascade and wreath products of fuzzy finite switchboard state machines

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999